graph n. 1.【数学】曲线图;坐标图,图表。 2.统计曲线。 vt. 用图表表示,把…绘入图表。 n. 胶版。 vt. 用胶版印刷。 graph3 n. 【语言学】 1.词的拼法。 2.表示音素的最小字母单位。
task n. 1.(派定的)工作,任务,功课。 2.艰苦的工作,苦差使。 3.〔废语〕租税,税款。 set (sb.) a task 派(某人)一个任务。 be at one's task 在做着工作。 It's quite a task to figure out 10 problems in an hour. 一小时内算出十道习题可是个艰苦的工作。 bring [call, take] sb. to task (for doing sth.) (为…)责备(某人)。 take a task upon oneself 接受任务。 vt. 1.派给工作。 2.虐待,使作苦工。 3.〔废语〕课税。 task one's energies 尽全力。 taskbar 【计算机】(通常显示于电脑屏幕底部的)任务栏。
Proposed a duplication based task scheduling algorithm with communication limits for general task graph, tdmscl 给出针对普通任务图带通信限制的基于复制调度算法tdmscl。
The paper presented task graph clustering algorithm, system graph clustering algorithm and mapping algorithm respectively, as well as their applications 文中分别给出了任务图的分簇算法,系统图的分簇算法和映射算法及实例。
Parallel and distributed systems, 1993, 4 : 175-186.4 singh h, youssef a . mapping and scheduling heterogeneous task graphs using genetic algorithms . in proc 在异构环境中,通常采用启发式调度算法,这种算法利用任务执行时间和系统负载的历史数据来调度任务。
Some improvements are made to enhance the generic algorithm's stability self adaptability and optimization efficiency . based on the ttg model, the co-synthesis method can map parallel task graphs to multiple processing unlts 本文提出了基于改进遗传算法解决软硬件协同综合问题的新方法,基于ttg模型,该方法能够实现多并发任务流在多处理单元结构上的映射。
Aiming at the computation intensive embedded systems with fixed periodical constraint, the thesis presents a timed task graph ( ttg ) model, which making a good lbundation of hardware / software co-synthesis and performance evaluation 针对有固定周期约束的计算密集型嵌入式系统,本文提出了带时间约束的任务流图模型(ttg),为软硬件协同综合综合和评价研究奠定了良好的基础。
It converts the ordinary task graph into fork and join graph, then apply the optimized result of fork and join graph to the scheduling of general task graph . tdmscl converts task scheduling process into the process of optimizing a topological sequence 该算法把普通任务图转换为join与fork等基本形状,然后运用对join图与fork图的优化调度研究结果对这些基本形状进行任务调度。
It converts the ordinary task graph into fork and join graph, then apply the optimized result of fork and join graph to the scheduling of general task graph . tdmscl converts task scheduling process into the process of optimizing a topological sequence 该算法把普通任务图转换为join与fork等基本形状,然后运用对join图与fork图的优化调度研究结果对这些基本形状进行任务调度。